A sufficient condition for a plane graph with maximum degree 6 to be class 1

A sufficient condition for spanning trees with bounded maximum degree in a graph

Some sufficient conditions for a planar graph to be of Class 1 1

In this paper, we first give some upper bounds on the number of edges for two classes of planar graphs. Then using these upper bounds, we obtain some sufficient conditions for a planar graph to be of Class 1.

A necessary and sufficient eigenvector condition for a connected graph to be bipartite

We give a necessary and sufficient condition for a graph to be bipartite in terms of an eigenvector corresponding to the largest eigenvalue of the adjacency matrix of the graph.

A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are threefold: first, the condition is general enough to cover a broad range of practical graph matching problems; second, a proof to establish equivalence between gr...

A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search

This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are threefold: first, the condition is general enough to cover a broad range of practical graph matching problems; second, a proof to establish equivalence between gr...